Performance of population size on Knapsack problem
نویسندگان
چکیده
منابع مشابه
On a Stochastic Knapsack Problem
The deterministic knapsack problem is a well known and well studied NP-hard combinatorial optimization problem. It consists in filling a knapsack with items out of a given set such that the weight capacity of the knapsack is respected and the total reward maximized. For a review of references on the stochastic knapsack problem, stochastic gradient algorithms and branch-and-bound methods see [4]...
متن کاملOn the Robust Knapsack Problem
We consider an uncertain variant of the knapsack problem that arises when the exact weight of each item is not exactly known in advance but belongs to a given interval, and the number of items whose weight differs from the nominal value is bounded by a constant. We analyze the worsening of the optimal solution value with respect to the classical problem, and exactly determine its worst-case per...
متن کاملthe effects of planning on accuracy and complexity of iranian efl students’ written narrative task performance
this study compared the different effects of form-focused guided planning vs. meaning-focused guided planning on iranian pre-intermediate students’ task performance. the study lasted for three weeks and concentrated on eight english structures. forty five pre-intermediate iranian students were randomly assigned to three groups of guided planning focus-on-form group (gpfg), guided planning focus...
15 صفحه اولthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Greedy Algorithm 3 Knapsack Problem 3.1 Fractional Knapsack Problem
Greedy algorithm is a group of algorithms that have one common characteristic, making the best choice locally at each step without considering future plans. Thus, the essence of greedy algorithm is a choice function: given a set of options, choose the current best option. Because of the myopic nature of greedy algorithm, it is (as expected) not correct for many problems. However, there are cert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Trends in Mathematical Science
سال: 2016
ISSN: 2147-5520
DOI: 10.20852/ntmsci.2016.111